Quantifying the Performance Impact of Graph Structure on Neighbour Iteration Strategies for PageRank
نویسندگان
چکیده
https://github.com/merijn/GPU-benchmarks #V #E ACC Triangles Diameter 90% Diameter as-Skitter 1.696.415 11.095.298 0,2581 28.769.868 25 6 cit-Patents 3.774.768 16.518.948 0,0757 7.515.023 22 9,4 email-EuAll 265.214 420.045 0,0671 267.313 14 4,5 Facebook 4.039 88.234 0,6055 1.612.010 8 4,7 GPlus 107.614 13.673.453 0,4901 1.073.677.742 6 3 roadNet-CA 1.965.206 2.766.607 0,0464 120.676 849 500 roadNet-TX 1.379.917 1.921.660 0,047 82.869 1.054 670 soc-Livejournal 4.847.571 68.993.773 0,2742 285.730.264 16 6,5 Twitter 81.306 1.768.149 0,5653 13.082.506 7 4,5 web-BerkStan 685.230 7.600.595 0,5967 64.690.980 514 9,9 web-Google 875.713 5.105.039 0,5143 13.391.903 21 8,1 wikiTalk 2.394.385 5.021.410 0,0526 9.203.519 9 4
منابع مشابه
FrogWild! - Fast PageRank Approximations on Graph Engines
We propose FrogWild, a novel algorithm for fast approxi-mation of high PageRank vertices, geared towards reducingnetwork costs of running traditional PageRank algorithms.Our algorithm can be seen as a quantized version of poweriteration that performs multiple parallel random walks overa directed graph. One important innovation is that we in-troduce a modification to the ...
متن کاملPageRank Computation Using PC Cluster
Link based analysis of web graphs has been extensively explored in many research projects. PageRank computation is one widely known approach which forms the basis of the Google search. PageRank assigns a global importance score to a web page based on the importance of other web pages pointing to it. PageRank is an iterative algorithm applying on a massively connected graph corresponding to seve...
متن کاملModels and Algorithms for Pagerank Sensitivity a Dissertation Submitted to the Institute of Computational and Mathematical Engineering and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
e PageRank model helps evaluate the relative importance of nodes in a large graph, such as the graph of links on the world wide web. An important piece of the PageRankmodel is the teleportation parameter α. We explore the interaction between α and PageRank through the lens of sensitivity analysis. Writing the PageRank vector as a function of α allows us to take a derivative, which is a simple s...
متن کاملThe Evaluation of the Team Performance of MLB Applying PageRank Algorithm
Background. There is a weakness that the win-loss ranking model in the MLB now is calculated based on the result of a win-loss game, so we assume that a ranking system considering the opponent’s team performance is necessary. Objectives. This study aims to suggest the PageRank algorithm to complement the problem with ranking calculated with winning ratio in calculating team ranking of US MLB. ...
متن کاملThe Performance of small samples in quantifying structure central Zagros forests utilizing the indexes based on the nearest neighbors
Abstract Todaychr('39')s forest structure issue has converted to one of the main ecological debates in forest science. Determination of forest structure characteristics is necessary to investigate stands changing process, for silviculture interventions and revival operations planning. In order to investigate structure of the part of Ghale-Gol forests in Khorramabad, a set of indices such as Cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015